Any-Angle Path Planning
نویسندگان
چکیده
منابع مشابه
Any-Angle Path Planning
In robotics and video games, one often discretizes continuous terrain into a grid with blocked and unblocked grid cells and then uses path-planning algorithms to find a shortest path on the resulting grid graph. This path, however, is typically not a shortest path in the continuous terrain. In this overview article, we discuss a path-planning methodology for quickly finding paths in continuous ...
متن کاملAny-Angle Path Planning for Computer Games
Path planning is a critical part of modern computer games; rare is the game where nothing moves and path planning is not necessary. A* is the workhorse for most path planning applications. Block A* is a state-of-the-art algorithm that is always faster than A* in experiments using game maps. Unlike other methods that improve upon A*’s performance, Block A* does not require knowledge of the map b...
متن کاملTheta*: Any-Angle Path Planning on Grids
Grids with blocked and unblocked cells are often used to represent terrain in computer games and robotics. However, paths formed by grid edges can be sub-optimal and unrealistic looking, since the possible headings are artificially constrained. We present Theta*, a variant of A*, that propagates information along grid edges without constraining the paths to grid edges. Theta* is simple, fast an...
متن کاملAbstract: Block A* and Any-Angle Path-Planning
Block A* and Any-angle Path-Planning Peter Yap and Neil Burch and Robert C. Holte and Jonathan Schaeffer Computing Science Department University of Alberta Edmonton, Alberta, Canada T6G 2E8 [email protected], {nburch, rholte, jonathan}@ualberta.ca
متن کاملIncremental Phi*: Incremental Any-Angle Path Planning on Grids
We study path planning on grids with blocked and unblocked cells. Any-angle path-planning algorithms find short paths fast because they propagate information along grid edges without constraining the resulting paths to grid edges. Incremental pathplanning algorithms solve a series of similar pathplanning problems faster than repeated single-shot searches because they reuse information from the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AI Magazine
سال: 2013
ISSN: 2371-9621,0738-4602
DOI: 10.1609/aimag.v34i4.2512